public class HashBuck2<K,V> {
    static class Node<K,V> {
        public K key;
        public V val;
        public Node<K,V> next;
        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }

    public Node<K,V>[] array=(Node<K,V>[])new Node[10];
    public int usedSize;
    public double loadFactor=0.75;

    public void put(K key, V val) {
        int hash=key.hashCode();//调用重写的hashcode
        int index=hash%array.length;

        Node<K,V> cur=array[index];
        //遍历当前链表，看是否存在当前值
        while(cur!=null) {
            if(cur.key.equals(key)) {  //调用重写的equals方法
                cur.val=val;
                return;
            }
            cur=cur.next;
        }

        Node<K,V> node=new Node<K,V>(key,val);
        node.next=array[index];
        array[index]=node;
        usedSize++;

        //扩容逻辑
    }

    public V get(K key) {
        int hash=key.hashCode();//调用重写的hashcode
        int index=hash%array.length;

        Node<K,V> cur=array[index];
        while(cur!=null) {
            if(cur.key.equals(key)) {  //调用重写的equals方法
                return cur.val;
            }
            cur=cur.next;
        }
        return null;
    }
}
